Unsupervised Coding with LOCOCODE
نویسندگان
چکیده
Traditional approaches to sensory coding use code component-oriented objective functions (COCOFs) to evaluate code quality. Previous COCOFs do not take into account the information-theoretic complexity of the code-generating mapping itself. We do: \Low-complexity coding and decoding" (Lococode) generates so-called lococodes that (1) convey information about the input data, (2) can be computed from the data by a low-complexity mapping (LCM), and (3) can be decoded by a LCM. We implement Lococode by training autoassociators with Flat Minimum Search (FMS), a general method for nding low-complexity neural nets. Lococode extracts optimal codes for diicult versions of the \bars" benchmark problem. As a preprocessor for a vowel recognition benchmark problem it sets the stage for excellent classiication performance.
منابع مشابه
Feature Extraction Through LOCOCODE
Low-complexity coding and decoding (LOCOCODE) is a novel approach to sensory coding and unsupervised learning. Unlike previous methods, it explicitly takes into account the information-theoretic complexity of the code generator. It computes lococodes that convey information about the input data and can be computed and decoded by low-complexity mappings. We implement LOCOCODE by training autoass...
متن کاملLococode
\Low-complexity coding and decoding" (Lococode) is a novel approach to sensory coding and unsupervised learning. Unlike previous methods it explicitly takes into account the information-theoretic complexity of the code generator: lococodes (1) convey information about the input data and (2) can be computed and decoded by low-complexity mappings. We implement Lococode by training autoassociators...
متن کاملLow-Complexity Coding and Decoding
We present a novel approach to sensory coding and unsu-pervised learning. It is called \Low-complexity coding and decoding" (Lococode). Unlike previous methods it explicitly takes into account the information-theoretic complexity of the code generator: lococodes (1) convey information about the input data and (2) can be computed and decoded by low-complexity mappings. To implement Lococode we t...
متن کاملLococode Performs Nonlinear Ica without Knowing the Number of Sources
Low-complexity coding and decoding (Lococode), a novel approach to sensory coding, trains autoassocia-tors (AAs) by Flat Minimum Search (FMS), a recent general method for nding low-complexity networks with high generalization capability. FMS works by minimizing both training error and required weight precision. We nd that as a by-product Lococode separates nonlinear superpositions of sources wi...
متن کاملNonlinear ICA through low-complexity autoencoders
We train autoencoders by Flat Minimum Search (FMS), a regularizer algorithm for finding low-complexity networks describable by few bits of information. As a by-product, this encourages nonlinear independent component analysis (ICA) and sparse codes of the input data. Flat minima are regions in weight space where (a) there is tolerable small error and (b) you can perturb the weights without grea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997